A Foundation for the Replacement of Pipelined Physical Join Operators in Adaptive Query Processing

نویسندگان

  • Kwanchai Eurviriyanukul
  • Alvaro A. A. Fernandes
  • Norman W. Paton
چکیده

Adaptive query processors make decisions as to the most effective evaluation strategy for a query based on feedback received while the query is being evaluated. In essence, any of the decisions made by the optimizer (e.g., on operator order or on which operators to use) may be revisited in an adaptive query processor. This paper focuses on changes to physical operators (e.g., the specific join operators used, such as hash-join or merge-join) in pipelined query evaluators. In so doing, the paper characterizes the runtime properties of pipelined operators in a way that makes explicit when specific operators may be replaced, and that allows the validity of operator replacements to be proved. This is illustrated with reference to the substitution of join operators during their evaluation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cuttlefish: A Lightweight Primitive for Adaptive Query Processing

Modern data processing applications execute increasingly sophisticated analysis that requires operations beyond traditional relational algebra. As a result, operators in query plans grow in diversity and complexity. Designing query optimizer rules and cost models to choose physical operators for all of these novel logical operators is impractical. To address this challenge, we develop Cuttlefis...

متن کامل

Continuous Query Optimization

In large federated and shared-nothing databases, resources can exhibit widely uctuating characteristics. Assumptions made at the time a query is submitted will rarely hold throughout the duration of query processing. As a result, traditional static query optimization and execution techniques are ine ective in these environments. In this paper we introduce a query processing mechanism called an ...

متن کامل

Toward adaptive query processing in wireless sensor networks

A wireless sensor network (WSN) consists of groups of spatially distributed networked sensors used to cooperatively monitor physical environmental conditions. These sensors are usually strongly resource constrained; hence the network makes use of base stations—nodes with robust disk storage, energy and capacity of processing. In a WSN, collected data are passed from sensor to sensor until the b...

متن کامل

Using State Modules for Adaptive Query Processing

We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and data¤ow among these SteMs is managed adaptively by an Eddy routing operator. Breaking the encapsulation of joins serves two purposes. First, it allows the Eddy to observe multiple physical operations embedded in a join algorithm, allowing for better calibr...

متن کامل

Dynamic Join Algorithm Switching at Query Execution Time

Join optimization is one of the most challenging tasks in query processing. The performance of joins depends not only on the algebraical/logical query execution plan (QEP), but also on the chosen join algorithms. Static optimization techniques often suffer from outdated or not available statistics on the data. This may result in sub-optimal QEPs and poor query execution times. Adaptive Query Pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006